Multilinear Maximum Distance Embedding Via L1%2DNorm Optimization.

Supervised manifold learning for image and video classification.

Pattern discovery for large mixed%2Dmode database.

Tensor Distance Based Multilinear Locality%2DPreserved Maximum Information Embedding.



A Unified Human%2DComputer Interaction Requirements Analysis Framework for Complex Socio%2Dtechnical Systems.

A Graph%2DBased Algorithm for Mining Multi%2DLevel Patterns in genomic Data.

Special issue on selected papers from IEEE DMF 2008.

Nonlinear dimensionality reduction with hybrid distance for trajectory representation of dynamic texture.

Transactions on Computational Science V

EvoArch An evolutionary algorithm for architectural layout design.

Dimensionality reduction for heterogeneous dataset in rushes editing.

A Graph Mining Algorithm for Classifying Chemical Compounds.

Mining Fuzzy Association Patterns in Gene Expression Data for Gene Function Prediction.

Topology%2DAware Energy Efficient Task Assignment for Collaborative In%2DNetwork Processing in Distributed Sensor Systems.

Topology%2DAware Energy Efficient Task Assignment for Collaborative In%2DNetwork Processing in Distributed Sensor Systems.

Towards Successive Privacy Protection in Sensor Networks.

Mining Gene Expression Patterns for the Discovery of Overlapping Clusters.

Analyzing Web Layout Structures using Graph Mining.

Multiple video trajectories representation using double%2Dlayer isometric feature mapping.

Dimensionality Reduction for Descriptor Generation in Rushes Editing.

An effective evolutionary algorithm for discrete%2Dvalued data clustering.

Software Process Fusion Exploring process relationships.

An Approach for Determining Evolutionary Distance in Network%2DBased Phylogenetic Analysis.

Using Data Mining for Dynamic Level Design in Games.

TopEVM Using Co%2Doccurrence and Topology Patterns of Enzymes in Metabolic Networks to Construct Phylogenetic Trees.



Rushes video summarization using audio%2Dvisual information and sequence alignment.

Inferring Gene Regulatory Networks From Expression Data by Discovering Fuzzy Dependency Relationships.

The Effect of Pairs in Program Design Tasks.

A High%2DThroughput MAC Protocol for Wireless Ad Hoc Networks.

Software process fusion by combining pair and solo programming.

UPSEC An Algorithm for Classifying Unaligned Protein Sequences into Functional Families.

Discovering High%2DOrder Patterns of Gene Expression Levels.

An Intelligent Home System as a Development and Test Platform for Ubiquitous Computing.

MAGMA An Algorithm for Mining Multi%2Dlevel Patterns in Genomic Data.

A Fault%2DTolerant Group Communication Protocol in Large Scale and Highly Dynamic Mobile Next%2DGeneration Networks.

Correction to %22Attribute Clustering for Grouping
This paper presents an overview of pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval
An Effective Data Mining Technique for Reconstructing gene Regulatory Networks from Time Series Expression Data.



A Fuzzy Data Mining Technique for the Reconstruction of Gene Regulatory Networks from Time Series Expression Data.

An Effective Data Mining Technique for Classifying Unaligned Protein Sequences into Functional Families.

VWMAC An Efficient MAC Protocol for Resolving Intra%2Dflow Contention in Wireless Ad Hoc Networks.

Delay%2DBounded Range Queries in DHT%2Dbased Peer%2Dto%2DPeer Systems.

Inference of Gene Regulatory Networks from Time Series Expression Data A Data Mining Approach.

Discovering Association Patterns in Large Spatio%2Dtemporal Databases.

Programming Task Demands.
This overview of C++ presents the key design, programming, and language-technical concepts using examples to give the reader a feel for the language. C++ is a general-purpose programming language with a bias towards systems programming that supports efficient low-level computation, data abstraction, object-oriented programming, and generic programming. +  1 Introduction and Overview  The C++ programming language provides a model of memory and computation that closely matches that of most computers. In addition, it provides powerful and flexible mechanisms for abstraction; that is, language constructs that allow the programmer to introduce and use new types of objects that match the concepts of an application. Thus, C++ supports styles of programming that rely on fairly direct manipulation of hardware resources to deliver a high degree of efficiency plus higher-level styles of programming that rely on user-defined types to provide a model of data and computation that is closer to a huma...
In%2DNetwork Data Processing forWireless Sensor Networks.

A novel data mining algorithm for reconstructing gene regulatory networks from microarray data.

Software Process Fusion Uniting Pair Programming and Solo Programming Processes.

A new fuzzy approach to improve fashion product development.

An evolutionary clustering algorithm for gene expression microarray data analysis.
Abstract—Clustering is concerned with the discovery of interesting groupings of records in a database. Many algorithms have been developed to tackle clustering problems in a variety of application domains. In particular, some of them have been used in bioinformatics research to uncover inherent clusters in gene expression microarray data. In this paper, we show how some popular clustering algorithms have been used for this purpose. Based on experiments using simulated and real data, we also show that the performance of these algorithms can be further improved. For more effective clustering of gene expression microarray data, which is typically characterized by a lot of noise, we propose a novel evolutionary algorithm called evolutionary clustering (EvoCluster). EvoCluster encodes an entire cluster grouping in a chromosome so that each gene in the chromosome encodes one cluster. Based on such encoding scheme, it makes use of a set of reproduction operators to facilitate the exchange of grouping information between chromosomes. The fitness function that the EvoCluster adopts is able to differentiate between how relevant a feature value is in determining a particular cluster grouping. As such, instead of just local pairwise distances, it also takes into consideration how clusters are arranged globally. Unlike many popular clustering algorithms, EvoCluster does not require the number of clusters to be decided in advance. Also, patterns hidden in each cluster can be explicitly revealed and presented for easy interpretation even by casual users. For performance evaluation, we have tested EvoCluster using both simulated and real data. Experimental results show that it can be very effective and robust even in the presence of noise and missing values. Also, when correlating the gene expression microarray data with DNA sequences, we were able to uncover significant biological binding sites (both previously known and unknown) in each cluster discovered by EvoCluster. Index Terms—Bioinformatics, clustering, DNA sequence analysis, evolutionary algorithms (EAs), gene expression microarray data analysis. I.
A Fuzzy Approach to Partitioning Continuous Attributes for Classification.

Pair programming productivity Novice%2Dnovice vs. expert%2Dexpert.

Hardware%2Fsoftware optimization for array %26 pointer boundary checking against buffer overflow attacks.

Structural Data Mining on Secondary Genomic Structure.

A Novel QoS Multicast Model in Mobile Ad Hoc Networks.

Inexperienced and Global Software Teams.

A Road Map for Implementing eXtreme Programming.

Inexperienced and Global Software Teams.

Mining changes in association rules a fuzzy approach.
Association rule mining is concerned with the discovery of interesting association relationships hidden in databases. Existing algorithms typically assume that data characteristics are stable over time. Their main focus is therefore to mine association rules in an efficient manner. However, the world constantly changes. This makes the characteristics of real-life entities represented by the data and hence the associations hidden in the data change over time. Detecting and adapting to the changes are usually critical to the success of many business organizations. This paper presents the problem of mining changes in association rules. Given a set of database partitions, each of which contains a set of transactions collected in a specific time period, a set of association rules is discovered in each database partition. We propose to perform data mining in the discovered association rules so as to reveal the regularities governing how the rules change in different time periods. Since the nature of many real-life entities is rather fuzzy, we propose to use linguistic variables and linguistic terms to represent the changes in the discovered association rules. In particular, fuzzy decision trees are built to discover the changes in the discovered association rules. The fuzzy decision trees are then converted to a set of fuzzy rules, called fuzzy meta-rules because they are rules about rules. By doing so, the changes hidden in the data can be revealed and presented to human users in a comprehensible form. Furthermore, the discovered changes can also be used to predict any change in the future. To evaluate the performance of our approach, we make use of a set of synthetic datasets, which are database partitions
Attribute Clustering for Grouping
This paper presents an attribute clustering method which is able to group genes based on their interdependence so as to mine meaningful patterns from the gene expression data. It can be used for gene grouping, selection and classification. The partitioning of a relational table into attribute subgroups allows a small number of attributes within or across the groups to be selected for analysis. By clustering attributes, the search dimension of a data mining algorithm is reduced. The reduction of search dimension is especially important to data mining in gene expression data because such data typically consist of a huge number of genes (attributes) and a small number of gene expression profiles (tuples). Most data mining algorithms are typically developed and optimized to scale to the number of tuples instead of the number of attributes. The situation becomes even worse when the number of attributes overwhelms the number of tuples, in which case, the likelihood of reporting patterns that are actually irrelevant due to chances becomes rather high. It is for the aforementioned reasons that gene grouping and selection are important preprocessing steps for many data mining algorithms to be effective when applied to gene expression data. This paper defines the problem of attribute clustering and introduces a methodology to solving it. Our proposed method groups interdependent attributes into clusters by optimizing a criterion
Clustering and re%2Dclustering for Pattern Discovery in Gene Expression Data.

Workflow analysis for web publishing using a stage%2Dactivity process model.

A novel group communication protocol using the RingNet hierarchy in mobile Internet.

A protocol for partitionable group membership service in mobile Internet.

Key Management for Secure Multicast Using the RingNet Hierarchy.

RGB A Scalable and Reliable Group Membership Protocol in Mobile Internet.

A Reliable Totally%2DOrdered Group Multicast Protocol for Mobile Internet.

A Cognitive Model for Solo Programming and Pair Programming.

Test Driven Development and Software Process Improvement in China.

QoSRHMM A QoS%2DAware Ring%2DBased Hierarchical Multi%2Dpath Multicast Routing Protocol.

Test Driven Development and Software Process Improvement in China.

Discovering Clusters in Gene Expression Data Using Evolutionary Approach.

Scaling Down Candidate Sets Based on the Temporal Feature of Items for Improved Hybrid Recommendations.

On the Temporal Analysis for Improved Hybrid Recommendations.

When Does a Pair Outperform Two Individuals%3F
Abstract. This paper reports experimental measurements of productivity and quality in pair programming. The work complements Laurie Williams ’ work on collaborative programming, in which Pair Programming and Solo Programming student groups wrote the same programs and then their activities were measured to investigate productivity, quality, etc. In this paper, Pair and Solo industrial programmer groups are requested to complete algorithm-style aptitude tests so as to observe the capability of solving algorithms in singles and in pairs. So doing is independent of the familiarity of a programming language. Besides, we also take another approach to examining pair programming. A single group of industrial programmers carries alternately out Pair Programming and Solo Programming. All these demonstrate that productivity in pair programming hinges upon algorithm design at all levels from understanding problems and implementing solutions. In addition, we reach similar conclusions to Williams. Our findings indicate that simple design, refactoring, and rapid feedback provide an excellent continuous-design environment for higher productivity in pair programming. 1
A novel evolutionary data mining algorithm with applications to churn prediction.
Classification is an important topic in data mining research. Given a set of data records, each of which belongs to one of a number of predefined classes, the classification problem is concerned with the discovery of classification rules that can allow records with unknown class membership to be correctly classified. Many algorithms have been developed to mine large data sets for classification models and they have been shown to be very effective. However, when it comes to determining the likelihood of each classification made, many of them are not designed with such purpose in mind. For this, they are not readily applicable to such problem as churn prediction. For such an application, the goal is not only to predict whether or not a subscriber would switch from one carrier to another, it is also important that the likelihood of the subscriber’s doing so be predicted. The reason for this is that a carrier can then choose to provide special personalized offer and services to those subscribers who are predicted with higher likelihood to churn. Given its importance, we propose a new data mining algorithm, called DMEL, to handle classification problems of which the accuracy of each predictions made has to be estimated. In performing its tasks, DMEL searches through the possible rule space using an evolutionary approach that has the following characteristics: (i) the evolutionary process begins with the generation of
Mining Fuzzy Rules in A Donor Database for Direct Marketing by a Charitable Organization.
in Hong Kong, we propose to use a new data mining technique to discover fuzzy rules for direct marketing. The discovered fuzzy rules employ linguistic terms, which are natural for human users to understand because of the affinity with the human knowledge representations, to represent the association relationships revealed in the data. The proposed approach utilizes an objective measure to distinguish interesting associations from uninteresting ones. Furthermore, it allows the ranking of discovered rules according to an uncertainty measure and allows quantitative values to be inferred by the discovered fuzzy rules. The domain expert from the organization is interested at finding how the response of a donor is affected by his demographics (e.g., age, education, occupation, salary, etc.) and his donation histories (e.g., the average yearly donation frequency, the average monthly donation amount, etc.). We applied the proposed approach to the donor database in order to mine a set of fuzzy rules. The experimental results showed that our approach is able to achieve accurate prediction of donor&#039;s response. By examining the discovered rules, the domain expert has found some unexpected patterns and formulated some direct mail strategies for future use.
A Study of Performance Testing of Web%2Dbased Systems.

Feature Construction for Student Group Forming Based on Their Browsing Behaviors in an E%2Dlearning System.

Integrating Process and Project Management for Multi%2DSite Software Development.

A Stage%2DActivity Process Model Facilitating Workflow Management for Web Publishing.

Classification with Degree of Membership A Fuzzy Approach.
research. It is concerned with the prediction of the values of some attribute in a database based on other attributes. To tackle this problem, most of the existing data mining algorithms adopt either a decision tree based approach or an approach that requires users to provide some userspecified thresholds to guide the search for interesting rules. In this paper, we propose a new approach based on the use of an objective interestingness measure to distinguish interesting rules from uninteresting ones. Using linguistic terms to represent the revealed regularities and exceptions, this approach is especially useful when the discovered rules are presented to human experts for examination because of the affinity with the human knowledge representation. The use of fuzzy technique allows the prediction of attribute values to be associated with degree of membership. Our approach is, therefore, able to deal with the cases that an object can belong to more than one class. For example, a person can suffer from cold and fever to certain extent at the same time. Furthermore, our approach is more resilient to noise and missing data values because of the use of fuzzy technique. To evaluate the performance of our approach, we tested it using several real-life databases. The experimental results show that it can be very effective at data mining tasks. In fact, when compared to popular data mining algorithms, our approach can be better able to uncover useful rules hidden in databases.
An Enterprise%2DWide Workflow Management System.
this paper, we present an analytic approach that considers the performance as well as the availability of the WFMS in its assessment of the quality of a given configuration of a distributed WFMS. The ap- proach is based on well known stochastic methods [Nel95, STP96, Tij94] and shows the suitability of these models to a new application field. The presented combination of the methods allows an analytic assessment of WFMS eliminating the usual time- and cost-intensive trial-and-error practice for system configuration. Particularly, we are able to rank the performance and the availability of different config- urations which use replicated workflow servers. Moreover, we can predict the performance degradation caused by transient failures of servers. These considerations lead to the notion of performability [STP96], a combination of performance and availability metrics. Likewise, we are able to calculate the necessary number of workflow server replications to meet the specified requirements for performance and availability. So, a crucial part of a configuration tool for distributed WFMS becomes analytically tractable and no longer depends on trial-and-error practices or the subjective intuition of the system administration staff.
Liaison A Workflow Model for Novel Applications.
The workflow paradigm is advancing the scope of process modelling by supporting rich process structures as well as resource allocation through the use of an organisation model. Its initial success has attracted a lot of interests in applying it to applications that are more complex than what can be handled by the current generation of workflow management systems. This paper introduces a new workflow model called Liaison that is designed to address the needs of these novel applications. More specifically, it provides a rich organisation model, sophisticated activity assignment constraints, an information model that also records presentation details, and a dynamic process model. An implemented prototype is described together with an examination of desirable improvements.  1 Introduction  The workflow paradigm is advancing the scope of process modelling by supporting rich process structures as well as resource allocation through the use of an organisation model. It has enjoyed some succes...
A visual programming environment for Z specifications.

Mining Fuzzy Association Rules.
In this paper, we introduce a novel technique, called F-APACS, for mining fuzzy association rules. Existing algorithms involve discretizing the domains of quantitative attributes into intervals so as to discover quantitative association rules. These intervals may not be concise and meaningful enough for human experts to easily obtain nontrivial knowledge from those rules discovered. Instead of using intervals, F-APACS employs linguistic terms to represent the revealed regularities and exceptions. The linguistic representation is especially useful when those rules discovered are presented to human experts for examination. The definition of linguistic terms is based on fuzzy set theory and hence we call the rules having these terms fuzzy association rules. The use of fuzzy techniques makes F-APACS resilient to noises such as inaccuracies in physical measurements of real-life entities and missing values in the databases. Furthermore, F-APACS employs adjusted difference analysis which has the advantage that it does not require any user-supplied thresholds which are often hard to determine. The fact that F-APACS is able to mine fuzzy association rules which utilize linguistic representation and that it uses an objective yet meaningful confidence measure to determine the interestingness of a rule makes it very effective at the discovery of rules from a real-life transactional database of a PBX system provided by a telecommunication corporation.
An effective algorithm for mining interesting quantitative association rules.
In this paper, we describe a novel technique, called APACS2, for mining interesting quantitative association rules from very large databases. To effectively mine such rules, APACS2 employs adjusted difference analysis. The use of this technique has the advantage that it does not require any user-supplied thresholds which are often hard to determine. Furthermore, APACS2 also has the advantage that it allows users to discover both positive and negative association rules. A positive association rule tells us that a record having certain attribute value will also have another attribute value whereas a negative association rule tells us that a record having certain attribute value will not have another attribute value. The fact that APACS2 is able to mine both positive and negative association rules and that it uses an objective yet meaningful measure to determine the interestingness of a rule makes it very effective at different data mining tasks.
Generating fuzzy rules for target tracking using a steady%2Dstate genetic algorithm.

Class%2DDependent Discretization for Inductive Learning from Continuous and Mixed%2DMode Data.

Statistical Technique for Extracting Classificatory Knowledge from Databases.

Synthesis of Statistical Knowledge from Time%2DDependent Data.

Performance Analysis of a Probabilistic Inductive Learning System.
earning. In Proceedings of the Seventh International Conference on Machine Learning, pages 179 188. Morgan Kaufmann, 1990.  L. Wixson. Scaling reinforcement learning techniques via modularity. In Proceedings of the Eighth International Workshop on Machine Learning, pages 368 372. Morgan Kaufmann, 1991.  49  [5] K. Chan and A. Wong. Performance analysis of a probabilistic inductive learning system. In Proceedings of the Seventh International Conference on Machine Learning, pages 16  23. Morgan Kaufmann, 1990.  [6] D. Chapman and L. Kaelbling. Learning from delayed reinforcement in a complex domain. In Proceedings of the IJCAI, 1991.  [7] A. Christiansen, T. Mason, and T. Mitchell. Learning reliable manipulation strategies without initial physical models. In Proceedings of the IEEE Conference on Robotics and Automation, pages 1224 1230. Morgan Kaufmann, 1990.  [8] J. Cormell. Minimalist Mobile Robotics: A Colony-style Architecture for an Artificial Creature. Academic Press, 1990. Also av
APACS a system for the automatic analysis and classification of conceptual pat terns.

OBSERVER A Probabilistic Learning System for Ordered Events.

